منابع مشابه
Invariants of Automatic Presentations and Semi-synchronous Transductions
Automatic structures are countable structures finitely presentable by a collection of automata. We study questions related to properties invariant with respect to the choice of an automatic presentation. We give a negative answer to a question of Rubin concerning definability of intrinsically regular relations by showing that order-invariant firstorder logic can be stronger than first-order log...
متن کاملStructured Derivation of Semi-Synchronous Algorithms
The semi-synchronous model is an important middle ground between the synchronous and the asynchronous models of distributed computing. In this model, processes can detect (timeout) when other processes fail. However, since detection is done by timing out, it incurs a cost much higher than the typical delay of messages. The paper presents a new communication primitive,Timely Announced Broadcast ...
متن کاملComposition of Path Transductions
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutions and graph products. When graphs are considered as automata, path transductions correspond to rational word transductions on the accepted languages. They define strict subclasses of monadic transductions and preserve...
متن کاملTransductions Rationnelles Décroissantes
— A characterization oj decreasing rational transductions is given, We show that x is a decreasing rational transduction jrom X* into Y* if and only ij there exist an alphabet Z, two alphabetic morphisms h:Z* -> X*,g:Z* -» Y*t with h e-jree and a regular language R o Z* such that x = go(nR)oh~. Résumé. — Nous proposons une caracterisation des transductions rationnelles décroissantes. Nous montr...
متن کاملIteration of rational transductions
The purpose of this paper is to show connections between iterated length preserving rational transductions and linear space computations Hence we study the smallest family of transductions containing length preserving rational transductions and closed under union composition and iteration We give several characterizations of this class using re stricted classes of length preserving rational tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2008
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-008-0083-2